The Slice Algorithm for irreducible decomposition of monomial ideals
نویسنده
چکیده
Irreducible decomposition of monomial ideals has an increasing number of applications from biology to pure math. This paper presents the Slice Algorithm for computing irreducible decompositions, Alexander duals and socles of monomial ideals. The paper includes experiments showing good performance in practice.
منابع مشابه
The Label Algorithm for Irreducible Decomposition of Monomial Ideals
Irreducible decomposition of monomial ideals has an increasing number of applications from biology to pure math, calling for the decomposition of ideals with a large amount of minimal generators. This paper presents an algorithm to compute such decompositions along with benchmarks showing a performance improvement by a factor of up to more than 1000. Performance can be further improved by tailo...
متن کاملComputing Irreducible Decomposition of Monomial Ideals
The paper presents two algorithms for finding irreducible decomposition of monomial ideals. The first one is recursive, derived from staircase structures of monomial ideals. This algorithm has a good performance for highly non-generic monomial ideals. The second one is an incremental algorithm, which computes decompositions of ideals by adding one generator at a time. Our analysis shows that th...
متن کاملDecomposition of ideals into pseudo-irreducible ideals in amalgamated algebra along an ideal
Let $f : A rightarrow B$ be a ring homomorphism and $J$ an ideal of $B$. In this paper, we give a necessary and sufficient condition for the amalgamated algebra along an ideal $Abowtie^fJ$ to be $J$-Noetherian. Then we give a characterization for pseudo-irreducible ideals of $Abowtie^fJ$, in special cases.
متن کاملMonomial Irreducible sln-Modules
In this article, we introduce monomial irreducible representations of the special linear Lie algebra $sln$. We will show that this kind of representations have bases for which the action of the Chevalley generators of the Lie algebra on the basis elements can be given by a simple formula.
متن کاملComputing lattice ideals of unions of monomial curves
In this paper we present a combinatorial study of binomial ideals of dimension 1 of k[X1, . . . , Xn], using monomial parametrizations of the irreducible affine curves defined by their associated primes. We find an algorithm that checks whether or not the ideal of a union of monomial curves is binomial and another one that calculates curves such that their associated ideal is a prescribed latti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 44 شماره
صفحات -
تاریخ انتشار 2009